C-Homogeneous Graphs Via Ordered Pencils
نویسنده
چکیده
Let C be a class of graphs closed under isomorphism and let ~ C be obtained from C by arc anchorage. A concept of ~ C-homogeneous graphs that include the C-ultrahomogeneous graphs is given, with the explicit construction of ~ C-homogeneous graphs that are not C-ultrahomogeneous, via ordered pencils of binary projective spaces.
منابع مشابه
On C-homogeneous graphs and ordered pencils
Let C be a class of graphs. A definition of a C-homogeneous graph G is given that generalizes that of C-ultrahomogeneous graph by considering each induced subgraph of G in C tethered by an arc. Let 2 < r ∈ Z, σ ∈ (0, r − 1) ∩ Z, t = 2 − 1 and s = 2. We require G to have each edge shared by exactly one copy of the complete subgraph K2s and one of the Turán graph Tts,t. Letting C = {K2s, Tts,t} l...
متن کاملConstructing {K2s, Tts,t}K2-Homogeneous Graphs with Pencils
Let C be a class of graphs. A restricted concept of C-homogeneous graphs generalizing the C-ultrahomogeneous graphs of [5] is given. Subsequently, a construction of non-line-graphical {K2s, Tts,t}K2 homogeneous graphs that includes the {K4, K2,2,2}K2 -ultrahomogeneous graph of [2], by means of ordered pencils of binary projective spaces, is shown to yield 20 such graphs that are not {K2s, Tts,t...
متن کاملOn C-ultrahomogeneous graphs and digraphs
The notion of a C-ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs and studied for the twelve cubic distance transitive graphs, with C formed by g-cycles and (k − 1)-paths, where g = girth and k = arc-transitivity. Excluding the Petersen, Heawood and Foster (90 vertices) graphs, one can go further by considering the (k− 1)-powers of g-cycles under orientation assignments p...
متن کاملOn K4-ultrahomogeneous and {K2s, Tts,t}K2-homogeneous graphs based on ordered pencils of binary projective spaces
Let C be a class of graphs. A definition of C-homogeneous graph G is given that fulfills the absence of a fitting generalization of C-ultrahomogeneous graph by considering each induced subgraph of G in C anchored by means of an arc. Let 2 < r ∈ Z, σ ∈ (0, r − 1) ∩ Z, t = 2 − 1 and s = 2. A construction of non-linegraphical connected {K2s, Tts,t}K2 -homogeneous graphs G (meaning C = {K2s, Tts,t}...
متن کاملOn a C4-ultrahomogeneous oriented graph
The notion of a C-ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs, and then a strongly connected ~ C4-ultrahomogeneous oriented graph on 168 vertices and 126 pairwise arc-disjoint 4-cycles is presented, with regular indegree and outdegree 3 and no circuits of lengths 2 and 3, by altering a definition of the Coxeter graph via pencils of ordered lines of the Fano plane in w...
متن کامل